<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    113. Path Sum II
   </h1>
   <p>
    Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
   </p>
   <p>
    <strong>
     Note:
    </strong>
    &nbsp;A leaf is a node with no children.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <p>
    Given the below binary tree and
    <code>
     sum = 22
    </code>
    ,
   </p>
   <pre>
      <strong>5</strong>
     <strong>/ \</strong>
    <strong>4   8</strong>
   <strong>/</strong>   / <strong>\</strong>
  <strong>11</strong>  13  <strong>4</strong>
 /  <strong>\</strong>    <strong>/</strong> \
7    <strong>2</strong>  <strong>5</strong>   1
</pre>
   <p>
    Return:
   </p>
   <pre>
[
   [5,4,11,2],
   [5,8,4,5]
]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    113. 路径总和 II
   </h1>
   <p>
    给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
   </p>
   <p>
    <strong>
     说明:
    </strong>
    &nbsp;叶子节点是指没有子节点的节点。
   </p>
   <p>
    <strong>
     示例:
    </strong>
    <br>
    给定如下二叉树，以及目标和&nbsp;
    <code>
     sum = 22
    </code>
    ，
   </p>
   <pre>              <strong>5</strong>
             / \
            <strong>4</strong>   <strong>8</strong>
           /   / \
          <strong>11</strong>  13  <strong>4</strong>
         /  \    / \
        7    <strong>2</strong>  <strong>5</strong>   1
</pre>
   <p>
    返回:
   </p>
   <pre>[
   [5,4,11,2],
   [5,8,4,5]
]
</pre>
  </div>
 </body>
</html>